Monomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra
نویسندگان
چکیده
In this paper we consider a free associative algebra on three generators over an arbitrary field K. Given a term ordering on the commutative polynomial ring on three variables over K, we construct uncountably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of normal forms. Then we show that the commutator ideal has an infinite reduced Gröbner basis with respect to these monomial orderings, and all initial ideals are distinct. Hence, the commutator ideal has at least uncountably many distinct reduced Gröbner bases. A Gröbner basis of the commutator ideal corresponds to a complete rewriting system for the free commutative monoid on three generators; our result also shows that this monoid has at least uncountably many distinct minimal complete rewriting systems. The monomial orderings we use are not compatible with multiplication, but are sufficient to solve the ideal membership problem for a specific ideal, in this case the commutator ideal. We propose that it is fruitful to consider such more general monomial orderings in non-commutative Gröbner basis theory.
منابع مشابه
Noncommutative Gröbner Bases for the Commutator Ideal
Let I denote the commutator ideal in the free associative algebra on m variables over an arbitrary field. In this article we prove there are exactly m! finite Gröbner bases for I , and uncountably many infinite Gröbner bases for I with respect to total division orderings. In addition, for m = 3 we give a complete description of its universal Gröbner basis. Let A be a finite set and let K be a f...
متن کاملRegular Gröbner Bases
In Ufnarovski (1989), the concept of automaton algebras is introduced. These are quotients of the non-commutative polynomial ring where the defining ideal allows some Gröbner basis with a regular set of leading words. However, nothing is reflected concerning the whole structure of the Gröbner basis (except of course for monomial algebras). In this paper we introduce the concept of regular Gröbn...
متن کاملSubalgebra Analogue to Standard Basis for Ideal
The theory of “subalgebra basis” analogous to standard basis (the generalization of Gröbner bases to monomial ordering which are not necessarily well ordering [1].) for ideals in polynomial rings over a field is developed. We call these bases “SASBI Basis” for “Subalgebra Analogue to Standard Basis for Ideals”. The case of global orderings, here they are called “SAGBI Basis” for “Subalgebra Ana...
متن کاملTaylor and Lyubeznik Resolutions via Gröbner Bases
Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that already a subcomplex defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem from the theory of Gröbner bases, whereas the Lyubeznik resolution is a consequence of Buchberger’s chain criterion. Finally, we relate Fröberg’s contractin...
متن کاملAlgorithms in Singular
Some algorithms for singularity theory and algebraic geometry The use of Gröbner basis computations for treating systems of polynomial equations has become an important tool in many areas. This paper introduces of the concept of standard bases (a generalization of Gröbner bases) and the application to some problems from algebraic geometry. The examples are presented as Singular commands. A gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 1999